A refinement of prudent choices

نویسنده

Nicolas Houy

چکیده

We charaterize the choice correspondences that can be rationalized by a procedure that is a refinement of the prudent choices exposed in [Houy, 2008]. Our characterization is made by means of the usual expansion axiom and by a weakening of the usual contraction axiom α.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Credible Coalitional Deviations by Prudent Players 1

In this paper we first explore the predictive power of the solution notion called conservative stable standard of behaviour (CSSB), introduced by Greenberg (1990) in environments with farsighted players (as modelled in Xue (1998)) as intuitively it is quite nice. Unfortunately, we find that CSSB has a number of undesirable properties. Therefore, we introduce a refinement of this which we call c...

متن کامل

Planning as Refinement Search: A Unified Framework for Evaluating Design Tradeoffs in Partial-Order Planning

Despite the long history of classical planning, there has been very little comparative analysis of the performance tradeoffs offered by the multitude of existing planning algorithms. This is partly due to the many different vocabularies within which planning algorithms are usually expressed. In this paper we show that refinement search provides a unifying framework within which various planning...

متن کامل

Fully Generalized 2d Constrained Delaunay Mesh Refinement

Traditional refinement algorithms insert a Steiner point from a few possible choices at each step. Our algorithm, on the contrary, defines regions from where a Steiner point can be selected and thus inserts a Steiner point among an infinite number of choices. Our algorithm significantly extends existing generalized algorithms by increasing the number and the size of these regions. The lower bou...

متن کامل